Coxeter Elements and Kazhdan–Lusztig Cells

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Coxeter Elements and Kazhdan-lusztig Cells

By the correspondence between Coxeter elements of a Coxeter system (W, S, Γ) and the acyclic orientations of the Coxeter graph Γ, we study some properties of elements in the set C0(W ). We show that when W is of finite, affine or hyperbolic type, any w ∈ C0(W ) satisfies w ∼ LR wJ with `(wJ ) = |J | = m(w) for some J ⊂ S. Now assume that W is of finite or affine type. We give an explicit descri...

متن کامل

Centers and Coxeter Elements

Suppose that G is a connected compact Lie group. We show that simple numerical information about the Weyl group of G can be used to obtain bounds, often sharp, on the size of the center of G. These bounds are obtained with the help of certain Coxeter elements in the Weyl group. Variants of the method use generalized Coxeter elements and apply to p-compact groups; in this case a splitting theore...

متن کامل

Essays on Coxeter groups Coxeter elements in finite Coxeter groups

A finite Coxeter group possesses a distinguished conjugacy class of Coxeter elements. The literature about these is very large, but it seems to me that there is still room for a better motivated account than what exists. The standard references on thismaterial are [Bourbaki:1968] and [Humphreys:1990], butmy treatment follows [Steinberg:1959] and [Steinberg:1985], from which the clever parts of ...

متن کامل

Conjugacy of Coxeter Elements

For a Coxeter group (W,S), a permutation of the set S is called a Coxeter word and the group element represented by the product is called a Coxeter element. Moving the first letter to the end of the word is called a rotation and two Coxeter elements are rotation equivalent if their words can be transformed into each other through a sequence of rotations and legal commutations. We prove that Cox...

متن کامل

The Enumeration of Coxeter Elements

Let (W, S, 0) be a Coxeter system: a Coxeter group W with S its distinguished generator set and 0 its Coxeter graph. In the present paper, we always assume that the cardinality l = |S| of S is finite. A Coxeter element of W is by definition a product of all generators s ∈ S in any fixed order. We use the notation C(W ) to denote the set of all the Coxeter elements in W . These elements play an ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Algebra

سال: 2002

ISSN: 0021-8693

DOI: 10.1006/jabr.2001.9090